On Rolling Cube Puzzles
نویسندگان
چکیده
We analyze the computational complexity of various rolling cube puzzles.
منابع مشابه
The Video Cube Puzzle: On Investigating Temporal Coordination
We have created a novel computer-based 3D puzzle, named Video Cube Puzzle to investigate human beings' temporal coordination abilities. Ten adult participants were studied solving ten cubic video puzzles of varying difficulties using a within-subject design. The ten puzzles have two segmentation variations, 2x2x2 and 3x3x3, and five texture variations, solid colours and four videos of drastical...
متن کاملImaginary Cubes and Their Puzzles
Imaginary cubes are three dimensional objects which have square silhouette projections in three orthogonal ways just as a cube has. In this paper, we study imaginary cubes and present assembly puzzles based on them. We show that there are 16 equivalence classes of minimal convex imaginary cubes, among whose representatives are a hexagonal bipyramid imaginary cube and a triangular antiprism imag...
متن کاملEFFECT OF FINISH ROLLING TEMPERATURE ON MICROSTRUCTURE,TEXTURE AND PLANAR ANISOTROPY IN ALUMINUM ALLOY AA3004 SHEETS
AA3004 alloy is widely used in can making. The major concern in the production of canbodies is earing, which develop by high planar anisotropy of rolled sheet. Balance ofrecrystallisation and rolling textures together with a uniform and fine grain microstructure canminimize the earing. The effects of finish rolling temperature (FRT) on planar anisotropy,microstructure, texture development and m...
متن کاملSub-Optimal Multi-Phase Path Planning: A Method for Solving Rubik's Revenge
Rubik’s Revenge, a 4× 4× 4 variant of the Rubik’s puzzles, remains to date as an unsolved puzzle. That is to say, we do not have a method or successful categorization to optimally solve every one of its approximately 7.401×10 possible configurations. Rubik’s Cube, Rubik’s Revenge’s predecessor (3×3×3), with its approximately 4.33 × 10 possible configurations, has only recently been completely s...
متن کاملThe Branching Factor of Regular Search Spaces
Many problems, such as the sliding-tile puzzles, generate search trees where different nodes have different numbers of children, in this case depending on the position of the blank. We show how to calculate the asymptotic branching factors of such problems, and how to efficiently compute the exact numbers of nodes at a given depth. This information is important for determining the complexity of...
متن کامل